Shotgun assembly of labeled graphs

نویسندگان

Elchanan Mossel

Nathan Ross

چکیده

We consider the problem of reconstructing graphs or labeled graphs from neighborhoods of a given radius r. Special instances of this problem include DNA shotgun assembly, neural network reconstruction, and assembling random jigsaw puzzles. We provide some necessary and some sufficient conditions for correct recovery both in combinatorial terms and for some generative models including random labelings of lattices, Erdős-Rényi random graphs, and the random jigsaw puzzle model. Many open problems and conjectures are provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling metagenome sequence assembly with probabilistic de Bruijn graphs.

Deep sequencing has enabled the investigation of a wide range of environmental microbial ecosystems, but the high memory requirements for de novo assembly of short-read shotgun sequencing data from these complex populations are an increasingly large practical barrier. Here we introduce a memory-efficient graph representation with which we can analyze the k-mer connectivity of metagenomic sample...

متن کامل

A linear threshold for uniqueness of solutions to random jigsaw puzzles

We consider a problem introduced by Mossel and Ross [Shotgun assembly of labeled graphs, arXiv:1504.07682]. Suppose a random n×n jigsaw puzzle is constructed by independently and uniformly choosing the shape of each “jig” from q possibilities. We are given the shuffled pieces. Then, depending on q, what is the probability that we can reassemble the puzzle uniquely? We say that two solutions of ...

متن کامل

Unique reconstruction threshold for random jigsaw puzzles

A random jigsaw puzzle is constructed by arranging n2 square pieces into an n× n grid and assigning to each edge of a piece one of q available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if q = o(n) then with high probability such a puzzle does not have a unique solution, while if q ≥ n1+ε for any constant ε > 0 then the solution i...

متن کامل

A note on 3-Prime cordial graphs

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

متن کامل